The Open University ’ s repository of research publications and other research outputs 2 monotone grid classes are finitely

The Open University's repository of research publications and other research outputs 2 monotone grid classes are finitely based Journal Article Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. In this note, we prove that all 2 × 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2 × 2 (generalised) grid classes that have two monotone cells in the same row.